Low-rank Characteristic Tensor Density Estimation Part II: Compression and Latent Density Estimation
نویسندگان
چکیده
Learning generative probabilistic models is a core problem in machine learning, which presents significant challenges due to the curse of dimensionality . This paper proposes joint dimensionality reduction and non-parametric density estimation framework, using novel estimator that can explicitly capture underlying distribution appropriate reduced-dimension representations input data. The idea jointly design nonlinear reducing auto-encoder model training data terms parsimonious set latent random variables, learn xmlns:xlink="http://www.w3.org/1999/xlink">canonical low-rank tensor variables Fourier domain. proposed “universal,” as opposed predefined prior xmlns:xlink="http://www.w3.org/1999/xlink">assumed variational auto-encoders. Joint optimization pursued via formulation learns both by minimizing combination negative log-likelihood domain reconstruction loss. We demonstrate achieves very promising results on toy, tabular, image datasets regression tasks, sampling, anomaly detection.
منابع مشابه
Optimal estimation of low rank density matrices
The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density matrices in trace regression models used in quantum state tomography (in particular, in the case of Pauli measurements) with explicit dependence of the bounds on t...
متن کاملOn Efficiency Criteria in Density Estimation
We discuss the classical efficiency criteria in density estimation and propose some variants. The context is a general density estimation scheme that contains the cases of i.i.d. or dependent random variables, in discrete or continuous time. Unbiased estimation, optimality and asymptotic optimality are considered. An example of a density estimator that satisfies some suggested criteria is given...
متن کاملStatistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm
This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...
متن کاملA geometric framework for density estimation and conditional density estimation
We introduce a geometrically intuitive procedure to obtain an estimator for a probability density function in the absence or presence of predictors. The estimation procedure is based on starting with an initial estimate of the density shape and then transforming it via a warping function to obtain the final estimate. The idea is to design the initial estimate to be computationally fast, albeit ...
متن کاملDensity Estimation
This paper provides a practical description of density estimation based on kernel methods. An important aim is to encourage practicing statisticians to apply these methods to data. As such, reference is made to implementations of these methods in R, S-PLUS and SAS.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2022
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2022.3158422